skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 7

Search for: All records

Creators/Authors contains: "Anderson, James H"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; (, IEEE)
    Free, publicly-accessible full text available March 12, 2026
  2. ; (, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)
    Mancuso, Renato (Ed.)
    As GPU-using tasks become more common in embedded, safety-critical systems, efficiency demands necessitate sharing a single GPU among multiple tasks. Unfortunately, existing ways to schedule multiple tasks onto a GPU often either result in a loss of ability to meet deadlines, or a loss of efficiency. In this work, we develop a system-level spatial compute partitioning mechanism for NVIDIA GPUs and demonstrate that it can be used to execute tasks efficiently without compromising timing predictability. Our tool, called nvtaskset, supports composable systems by not requiring task, driver, or hardware modifications. In our evaluation, we demonstrate sub-1-μs overheads, stronger partition enforcement, and finer-granularity partitioning when using our mechanism instead of NVIDIA’s Multi-Process Service (MPS) or Multi-instance GPU (MiG) features. 
    more » « less
    Full Text Available 
  3. ; ; ; ; ; ; ; ; ; (, IEEE)
    Free, publicly-accessible full text available May 19, 2026
  4. ; (, IEEE)
    Full Text Available 
  5. ; (, IEEE)
    Full Text Available 
  6. ; ; (, ACM)
    Full Text Available 
  7. ; (, IEEE)
    Free, publicly-accessible full text available May 6, 2026
  8. ; ; (, IEEE)
    Free, publicly-accessible full text available May 6, 2026
  9. ; ; (, IEEE)
    Free, publicly-accessible full text available May 6, 2026
  10. ; (, IEEE)
    Full Text Available